منابع مشابه
Exactly solvable scale-free network model.
We study a deterministic scale-free network recently proposed by Barabási, Ravasz, and Vicsek. We find that there are two types of nodes: the hub and rim nodes, which form a bipartite structure of the network. We first derive the exact numbers P (k) of nodes with degree k for the hub and rim nodes in each generation of the network, respectively. Using this, we obtain the exact exponents of the ...
متن کاملBounded confidence model on a still growing scale-free network
A Bounded Confidence (BC) model of socio-physics, in which the agents have continuous opinions and can influence each other only if the distance between their opinions is below a threshold, is simulated on a still growing scale-free network considering several different strategies: for each new node (or vertex), that is added to the network all individuals of the network have their opinions upd...
متن کاملAnalytic solution of a static scale-free network model
We present a detailed analytical study of a paradigmatic scale-free network model, the Static Model. Analytical expressions for its main properties are derived by using the hidden variables formalism. We map the model into a canonic hidden variables one, and solve the latter. The good agreement between our predictions and extensive simulations of the original model suggests that the mapping is ...
متن کاملRandom model for RNA interference yields scale free network
We introduce a random bit-string model of post-transcriptional genetic regulation based on sequence matching. The model spontaneously yields a scale free network with power law scaling with γ = −1 and also exhibits log-periodic behaviour. The in-degree distribution is much narrower, and exhibits a pronounced peak followed by a Gaussian distribution. The network is of the smallest world type, wi...
متن کاملEvolving Scale-free Network Model with Tunable Clustering
The Barabási-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability p, we add a new node with m edges which preferentially link to the nodes presented in the network; with probability 1− p, we add m edges among the present nodes. A node is preferentially selected by its degree to add an edge randomly among its neighbors. U...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2002
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.66.056105